Abstract Preference Frameworks - a Unifying Perspective on Separability and Strong Equivalence

نویسندگان

  • Wolfgang Faber
  • Miroslaw Truszczynski
  • Stefan Woltran
چکیده

Preference Frameworks — A Unifying Perspective on Separability and Strong Equivalence Wolfgang Faber University of Calabria [email protected] Mirosław Truszczyński University of Kentucky [email protected] Stefan Woltran Vienna University of Technology [email protected]

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Characterizing Strong Equivalence for Argumentation Frameworks

Since argumentation is an inherently dynamic process, it is of great importance to understand the effect of incorporating new information into given argumentation frameworks. In this work, we address this issue by analyzing equivalence between argumentation frameworks under the assumption that the frameworks in question are incomplete, i.e. further information might be added later to both frame...

متن کامل

Stable Model Semantics of Abstract Dialectical Frameworks Revisited: A Logic Programming Perspective

This paper relates two extensively studied formalisms: abstract dialectical frameworks and logic programs with generalized atoms or similar constructs. While the syntactic similarity is easy to see, also a strong relation between various stable model semantics proposed for these formalisms is shown by means of a unifying framework in which these semantics are restated in terms of program reduct...

متن کامل

Strong Equivalence of Logic Programs with Abstract Constraint Atoms

Constraint Atoms Guohua Liu, Randy Goebel, Tomi Janhunen, Ilkka Niemelä, and Jia-Huai You 1 Aalto University, Department of Information and Computer Science {Guohua.Liu,Tomi.Janhunen,Ilkka.Niemela}@aalto.fi 2 University of Alberta, Department of Computing Science {goebel,you}@cs.ualberta.ca Abstract. Logic programs with abstract constraint atoms provide a Logic programs with abstract constraint...

متن کامل

Definable cardinals just beyond R/Q

We establish the inexistence of countable bases for the family of definable cardinals associated with countable Borel equivalence relations which are not measure reducible to E0, thereby ruling out natural generalizations of the Glimm-Effros dichotomy. We also push the primary known results concerning the abstract structure of the Borel cardinal hierarchy nearly to its base, using arguments sub...

متن کامل

A General Notion of Equivalence for Abstract Argumentation

We introduce a parametrized equivalence notion for abstract argumentation that subsumes standard and strong equivalence as corner cases. Under this notion, two argumentation frameworks are equivalent if they deliver the same extensions under any addition of arguments and attacks that do not affect a given set of core arguments. As we will see, this notion of equivalence nicely captures the conc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013